A self-stabilizing distributed algorithm for edge-coloring general graphs
نویسندگان
چکیده
منابع مشابه
A Self-Stabilizing (Δ+4)-Edge-Coloring Algorithm for Planar Graphs in Anonymous Uniform Systems
This paper proposes a self-stabilizing edge coloring algorithm using (Δ + 4) colors for distributed systems of a planar graph topology, where Δ ≥ 5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O(n 2) moves under the central daemon model.
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملSelf-Stabilizing Algorithms For Orderings And Colorings
A k-forward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called self-stabilizing. We obtain three self-stabilizing (s-s) algorithms for finding a k-forward numbering, provided one exists. One such algorit...
متن کاملDeveloping Self-stabilizing Coloring Algorithms via Systematic Randomization
We consider the problem of designing uniform self-stabilizing distributed algorithms for coloring chains and oriented rings. We provide deterministic uniform self-stabilizing algorithms for some of the problems , and impossibility results for the other problems. For problems in the latter class, we present random-ized self-stabilizing algorithms. These results lead to a general method for obtai...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 38 شماره
صفحات -
تاریخ انتشار 2007